Higher-Order Model Checking
نویسندگان
چکیده
منابع مشابه
Higher-Order Bounded Model Checking
We present a Bounded Model Checking technique for higherorder programs. The vehicle of our study is a higher-order calculus with general references. Our technique is a symbolic state syntactical translation based on SMT solvers, adapted to a setting where the values passed and stored during computation can be functions of arbitrary order. We prove that our algorithm is sound, and devise an opti...
متن کاملModel Checking and Higher - Order
Since Muller and Schupp have shown that monadic second-order logic is decidable for context-free graphs in MS85], several specialized procedures have been developed for related problems, mostly for sublogics like the modal-calculus, or even its alternation-free fragment. This work shows the decidability of s1s, the trace version of msol, for the richer set of macro graphs. The generation mechan...
متن کاملPairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking
We propose a sound, complete, and automatic method for pairwise reachability analysis of higher-order concurrent programs with recursion, nested locks, joins, and dynamic thread creation. The method is based on a reduction to higher-order model checking (i.e., model checking of trees generated by higher-order recursion schemes). It can be considered an extension of Gawlitz et al.’s work on the ...
متن کاملHigher-Order Model Checking by Abstraction of Type Derivation Rewriting
Model checking of recursion schemes, known as higher-order model checking, has actively been studied recently and is becoming a basis for verification of higher-order programs. Some practical model checking algorithms have been developed based on the reduction from model checking to intersection type inference, but they are not completely satisfactory. We propose a novel approach to developing ...
متن کاملA ZDD-Based Efficient Higher-Order Model Checking Algorithm
The model checking of higher-order recursion schemes, aka. higher-order model checking, has recently been applied to automated verification of higher-order programs. Despite its extremely high worstcase complexity, practical algorithms have been developed that work well for typical inputs that arise in program verification. Even the stateof-the-art algorithms are, however, not scalable enough f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.77.2